18 research outputs found

    D-optimal matrices of orders 118, 138, 150, 154 and 174

    Full text link
    We construct supplementary difference sets (SDS) with parameters (59;28,22;21)(59;28,22;21), (69;31,27;24)(69;31,27;24), (75;36,29;28)(75;36,29;28), (77;34,31;27)(77;34,31;27) and (87;38,36;31)(87;38,36;31). These SDSs give D-optimal designs (DO-designs) of two-circulant type of orders 118,138,150,154 and 174. Until now, no DO-designs of orders 138,154 and 174 were known. While a DO-design (not of two-circulant type) of order 150 was constructed previously by Holzmann and Kharaghani, no such design of two-circulant type was known. The smallest undecided order for DO-designs is now 198. We use a novel property of the compression map to speed up some computations.Comment: 14 pages. arXiv admin note: substantial text overlap with arXiv:1409.596

    Structural changes along and above the yrast line of Dy154

    Get PDF
    States in Dy154 have been located up to I=48+ and their lifetimes measured. Marked structural changes occur along the yrast line with a transition from prolate to oblate shape, followed by an unexpected return to moderate collectivity at the highest spins. Structural changes with increasing energy above the yrast line are also observed

    Formal Verification of BPEL4WS Business Collaborations

    No full text

    A queue based mutual exclusion algorithm

    Get PDF
    A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only requires shared variables in a memory model where shared variables need not be accessed atomically. We prove mutual exclusion by reformulating the algorithm as a transition system (automaton), and applying simulation of automata. The proof has been verified with the higher-order interactive theorem prover PVS. Under an additional atomicity assumption, the algorithm is starvation free, and we conjecture that no competing process is passed by any other process more than once. This conjecture was verified by model checking for systems with at most five processes.

    New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences

    No full text
    Abstract. A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three new constructions of CNC Hadamard matrices. We give a primary construction using a flipping operation on the submatrices of the reduced form of a Hadamard matrix. We show that, up to some restrictions, the Kronecker product preserves the CNC property of Hadamard matrices and use this fact to give two secondary constructions of Hadamard matrices. The applications to construct low correlation zone sequences are provided

    Lifetime measurements of terminating and collective high-spin states in 155DY^{155}DY and 156DY^{156}DY

    Get PDF
    Lifetime measurements for the isotopes 155Dy and 156Dy have been extended up to spins around 40h{stroke} by the Doppler shift attenuation method in conjunction with γ-γ-coincidence measurements. Results have been obtained for the yrast band in 156Dy and for three bands in 155Dy. Strong retardations of the E2-strengt were observed for intruding terminating sequences, for which specific single particle configurations are suggested
    corecore